OTTER Proofs in Tarskian Geometry
نویسندگان
چکیده
We report on a project to use OTTER to find proofs of the theorems in Tarskian geometry proved in Szmielew’s part (Part I) of [9]. These theorems start with fundamental properties of betweenness, and end with the development of geometric definitions of addition and multiplication that permit the representation of models of geometry as planes over Euclidean fields, or over real-closed fields in the case of full continuity. They include the four challenge problems left unsolved by Quaife, who two decades ago found some OTTER proofs in Tarskian geometry (solving challenges issued in [15]). Quaife’s four challenge problems were: every line segment has a midpoint; every segment is the base of some isosceles triangle; the outer Pasch axiom (assuming inner Pasch as an axiom); and the first outer connectivity property of betweenness. These are to be proved without any parallel axiom and without even line-circle continuity. These are difficult theorems, the first proofs of which were the heart of Gupta’s Ph. D. thesis under Tarski. OTTER proved them all in 2012. Our success, we argue, is due to improvements in techniques of automated deduction, rather than to increases in computer speed and memory. The theory of Hilbert (1899) can be translated into Tarski’s language, interpreting lines as pairs of distinct points, and angles as ordered triples of non-collinear points. Under this interpretation, the axioms of Hilbert either occur among, or are easily deduced from, theorems in the first 11 (of 16) chapters of Szmielew. We have found Otter proofs of all of Hilbert’s axioms from Tarski’s axioms (i.e. through Satz 11.49 of Szmielew, plus Satz 12.11). Narboux and Braun have recently checked these same proofs in Coq.
منابع مشابه
EPiC Series in Computing
We describe our initial experiments with several state-of-the-art automated theorem provers on the problems in Tarskian Geometry created by Beeson and Wos. In comparison to the manually-guided OTTER proofs by Beeson and Wos, we can solve a large number of problems fully automatically, in particular thanks to the recent large-theory reasoning methods.
متن کاملHuman-Oriented Proof Techniques are Relevant for Proof Tutoring
Automated theorem proving techniques are increasingly used within interactive environments for the teaching of proof techniques. Examples are the Advanced Geometry Tutor (Matsuda and VanLehn, 2005), the geometry learning environment ANGLE (Koedinger and Anderson, 1993), the EPGY theorem proving environment (McMath et al., 2001), the Baghera platform (Trgalova and Chaachoua, 2009) for the assess...
متن کاملNatural Style for Resolution Proofs in Theorema
The proofs generated by clausa reasoners are often too long and hard to follow by the user (even if experienced), because most of the structure of the initial problem is not expressed by the clausal formula. For this reason, it is very important, especially for practical applications, to express the proofs in a more natural style. This paper analyzes the method suggested by [Meier], namely to p...
متن کاملSystem Description: IVY
IVY is a veriied theorem prover for rst-order logic with equality. It is coded in ACL2, and it makes calls to the theorem prover Otter to search for proofs and to the program MACE to search for coun-termodels. Veriications of Otter and MACE are not practical because they are coded in C. Instead, Otter and MACE give detailed proofs and models that are checked by veriied ACL2 programs. In additio...
متن کاملAxiomatic Proofs through Automated Reasoning*
search of the seminal papers and significant books devoted to the study of various types of logic t e reveals that many proofs are missing. Indeed, if one seeks an axiomatic proof (of the type that Hilber njoyed) relying solely on, say, condensed detachment, in many cases one finds that none is offered by d t the literature. In part prompted by this discovery, we embarked on an intense study de...
متن کامل